Moment methods in extremal geometry Proefschrift ter verkrijging van de graad van doctor aan de Technische Universiteit Delft, op gezag van de Rector Magnificus prof. ir. K.C.A.M. Luyben,

Source URL: www.daviddelaat.nl

• Mathematical optimization
• Operations research
• Discrete geometry
• Convex optimization
• Packing problems
• Sphere packing
• Semidefinite programming
• Linear programming
• Conic optimization
• Relaxation
• Kepler conjecture
• Optimization problem

Sensor Localization with Deterministic Accuracy Guarantee Ryo Sugihara Rajesh K. Gupta

Source URL: mesl.ucsd.edu

• Operations research
• Linear programming
• Mathematical optimization
• Real algebraic geometry
• Semidefinite programming
• Routing algorithms

Multi-reference Alignment: Estimating Group Transformations using Semidefinite Programming Amit Singer Princeton University, Department of Mathematics and PACM June 19, 2014

Source URL: mmds-data.org

• Rotation group SO
• Rotational symmetry

CS261: A Second Course in Algorithms Lecture #9: Linear Programming Duality (Part 2)∗ Tim Roughgarden† February 2,

Source URL: theory.stanford.edu

• Mathematical optimization
• Convex optimization
• Linear programming
• Operations research
• Duality
• Weak duality
• Strong duality
• Constraint
• Duality gap
• Semidefinite programming

A DIRECT FORMULATION FOR SPARSE PCA USING SEMIDEFINITE PROGRAMMING∗ ALEXANDRE D’ASPREMONT† , LAURENT EL GHAOUI‡ , MICHAEL I. JORDAN§ , AND GERT R. G. LANCKRIET¶ Abstract. Given a covariance matrix, we consider

Source URL: eceweb.ucsd.edu

• Mathematical optimization
• Matrix theory
• Multivariate statistics
• Linear programming
• Operations research
• Sparse PCA
• Semidefinite programming
• Principal component analysis
• Convex optimization
• Eigenvalues and eigenvectors
• Matrix
• Singular value decomposition

CS261: Exercise Set #4 For the week of January 25–29, 2016 Instructions: (1) Do not turn anything in. (2) The course staff is happy to discuss the solutions of these exercises with you in office hours or on Piazza.

Source URL: theory.stanford.edu

• Linear programming
• Convex optimization
• Operations research
• Mathematical optimization
• Combinatorial optimization
• Duality
• Weak duality
• Ellipsoid method
• Semidefinite programming

Moment methods in energy minimization David de Laat Delft University of Technology (Joint with Fernando Oliveira and Frank Vallentin) L´aszl´

Source URL: www.daviddelaat.nl

• Operations research
• Discrete geometry
• NP-complete problems
• Conjectures
• Circle packing
• Sphere packing
• Independent set
• Kepler conjecture
• Tammes problem
• Mathematical optimization
• Semidefinite programming
• FranklRdl graph

Combinatorial Optimization Solutions for the Maximum Quartet Consistency Problem Ant´ onio Morgado and Joao Marques-Silva School of Electronics and Computer Science, University of Southampton, UK ,jpms@e

Source URL: ceur-ws.org

• Operations research
• Mathematical optimization
• Constraint programming
• Logic in computer science
• NP-complete problems
• Topology
• Satisfiability modulo theories
• Dynamic programming
• Semidefinite programming

Algorithms as Mechanisms: The Price of Anarchy of Relax-and-Round ¨ PAUL DUTTING, ETH Z¨ urich

Source URL: paulduetting.com

• Operations research
• Approximation algorithm
• Randomized rounding
• Greedy algorithm
• Algorithm
• Relaxation
• Combinatorial auction
• Price of anarchy
• Linear programming
• Travelling salesman problem
• Integer programming
• Semidefinite programming

SEMINÁRIO 15 de Maio deDepartamento de Matemática, sala Sousa Pinto, 11:30-12:30) Título: Recent progress in the application of semidefinite programming to discrete optimization. Orador: Miguel F. Anjos, Associ

Source URL: ceoc.mat.ua.pt